翻訳と辞書 Words near each other ・ Ho Tung Lau ・ HNZ Group ・ Hnátnice ・ Hnæf ・ Hnífsdalur ・ Hnífur Abrahams ・ Hnúšťa ・ Hněvkovice (Havlíčkův Brod District) ・ Hněvnice ・ Hněvotín ・ Hněvošice ・ Hněvín Castle ・ Hněvčeves ・ HNŠK Moslavina ・ Ho ・ HO (complexity) ・ Ho (kana) ・ Ho (Korean name) ・ Ho an den ・ Ho Baron ・ Ho bisogno di vederti ・ Ho Bo Woods ・ Ho Central (Ghana parliament constituency) ・ Ho Che Anderson ・ Ho Cheng-hong ・ Ho Chi Fung ・ Ho Chi Ho ・ Ho Chi Minh ・ Ho Chi Minh (disambiguation) ・ Ho Chi Minh City Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク HO (complexity) ： ウィキペディア英語版 HO (complexity) High-order logic is an extension of first-order and second-order with high order quantifiers. In descriptive complexity we can see that it is equal to the ELEMENTARY functions. There is a relation between the $i$th order and non determinist algorithm the time of which is with $i-1$ level of exponentials. == Definitions and notations == We define high-order variable, a variable of order $i>1$ has got an arity $k$ and represent any set of $k$-tuples of elements of order $i-1$. They are usually written in upper-case and with a natural number as exponent to indicate the order. High order logic is the set of FO formulae where we add quantification over higher-order variables, hence we will use the terms defined in the FO article without defining them again. HO$^i$ is the set of formulae where variable's order are at most $i$. HO$^i\_j$ is the subset of the formulae of the form $\backslash phi=\backslash exists\; \backslash overline\backslash forall\backslash overline\backslash dots\; Q\; \backslash overline\backslash psi$ where $Q$ is a quantifier, $Q\; \backslash overline$ means that $\backslash overline$ is a tuple of variable of order $i$ with the same quantification. So it is the set of formulae with $j$ alternations of quantifiers of $i$th order, beginning by and $\backslash exists$, followed by a formula of order $i-1$. Using the tetration's standard notation, $\backslash exp\_2^0(x)=x$ and $\backslash exp\_2^(x)=2^$. $\backslash exp\_2^(x)=2^\}\}\}$ with $i$ times $2$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「HO (complexity)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.